Multi-objective MaxiMin Sorting Scheme
نویسندگان
چکیده
Obtaining a well distributed non-dominated Pareto front is one of the key issues in multi-objective optimization algorithms. This paper proposes a new variant for the elitist selection operator to the NSGA-II algorithm, which promotes well distributed non-dominated fronts. The basic idea is to replace the crowding distance method by a maximin technique. The proposed technique is deployed in well known test functions and compared with the crowding distance method used in the NSGA-II algorithm. This comparison is performed in terms of achieved front solutions distribution by using distance performance indices.
منابع مشابه
Modeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems
In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...
متن کاملAn Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملA MULTI-OBJECTIVE DECENTRALIZED MULTIPLE CONSTRUCTION PROJECTS SCHEDULING PROBLEM CONSIDERING PERIODIC SERVICES AND ORDERING POLICIES
In decentralized construction projects, costs are mostly related to investment, material, holding, logistics, and other minor costs for implementation. For this reason, simultaneous planning of these items and appropriate scheduling of activities can significantly reduce the total costs of the project undertaken. This paper investigates the decentralized multiple construction projects schedulin...
متن کاملSelection Operators Based on Maximin Fitness Function for Multi-Objective Evolutionary Algorithms
We propose three operators based on MFF. The first uses MFF. The second uses MFF when applies Maximin-Constraint and uses modified MFF when applies Maximin-Clustering. The third uses modified MFF. According to the results, the three operators are competitive to solve multi-objective optimization problems having both low dimensionality (two or three) and high dimensionality (more than three) in ...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کامل